Computational mathematics - PDFSEARCH.IO - Document Search Engine

Computational mathematics
Results: 4662

#	Item
91	Microsoft Word - orbs7180.doc Add to Reading List Source URL: www.math.hkbu.edu.hk Language: English - Date: 2013-09-27 05:04:48 Operations research Mathematics Computational complexity theory Applied mathematics Mathematical optimization Heuristic Integer programming Relaxation Branch and bound Combinatorial optimization Travelling salesman problem Algorithm
92	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-06-04 08:46:15 Computational complexity theory Mathematics NP-complete problems Theory of computation Packing problems Operations research Approximation algorithms Knapsack problem Vertex cover Bin packing problem Hardness of approximation Algorithm
93	MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Sparse Preconditioning for Model Predictive Control Knyazev, A.; Malyshev, A. TR2016-046 Add to Reading List Source URL: www.merl.com Language: English - Date: 2016-07-07 12:22:34 Numerical linear algebra Mathematics Preconditioner Mathematical analysis Iterative method Generalized minimal residual method Optimal control Computational science
94	SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-03-13 08:17:47 Computational complexity theory Mathematics NP-complete problems Theory of computation Set cover problem Approximation algorithm Algorithm Analysis of algorithms Bin packing problem Vertex cover
95	A THEORY OF THE CARTOGRAPHIC LINE Thomas K. Peucker Simon Fraser University Add to Reading List Source URL: mapcontext.com Language: English - Date: 2008-08-29 22:41:20 Geometry Mathematics Space Polygons Elementary geometry Euclidean plane geometry Convex geometry Convex polygon Computational geometry Point in polygon Star polygon Perpendicular
96	Computational and Applied Mathematics - CAM 2014 http://w3.math.uminho.pt/CAM2014 June 30-July 3, 2014 Guimarães, Portugal CAM 2014 is a workshop organized as part of the International Conference on Computational Add to Reading List Source URL: w3.math.uminho.pt Language: English - Date: 2013-12-10 13:29:47 Computational science University of Minho University of Aveiro Hypercomplex analysis
97	Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel † Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:33 Graph theory Mathematics Combinatorial optimization Edsger W. Dijkstra Matrix multiplication algorithm NP-complete problems Matching Routing algorithms Computational complexity theory Connected component Dynamic programming Graph coloring
98	C:uments and Settingsc. documentoscheTt 27, 1T.dvi Add to Reading List Source URL: personales.upv.es Language: English - Date: 2004-02-19 03:12:54 Genetic algorithms Applied mathematics Operations research Mathematics Cybernetics Computational complexity theory NP-complete problems Mathematical optimization Crossover Chromosome Mutation Vehicle routing problem
99	Artificial Neural Networks For Spatial Perception Towards Visual Object Localisation in Humanoid Robots J¨urgen Leitner, Simon Harding, Mikhail Frank, Alexander F¨orster, J¨urgen Schmidhuber Abstract— In this paper, Add to Reading List Source URL: people.idsia.ch Language: English - Date: 2013-08-16 11:18:14 Computational neuroscience Artificial intelligence Applied mathematics Artificial neural networks Cybernetics Computational statistics ICub Science and technology in Europe Robotics Humanoid robot Cognitive robotics Robot
100	comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:22 Computational complexity theory Graph theory NP-complete problems Mathematics Travelling salesman problem Set TSP problem Steiner tree problem Vertex cover Approximation algorithm APX Cut Time complexity

UPDATE